On Lexicographic Products of Two Fuzzy Graphs
نویسندگان
چکیده
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products are studied. The degree of a vertex in the lexicographic products of two fuzzy graphs is obtained. A relationship between the lexicographic min-product and lexicographic max-product is also obtained.
منابع مشابه
Further Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملSolving matrix games with hesitant fuzzy pay-offs
The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملOn the Zagreb and Eccentricity Coindices of Graph Products
The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...
متن کامل